Structural inclusion in the pi-calculus with replication
نویسندگان
چکیده
منابع مشابه
Structural inclusion in the pi-calculus with replication
Three notions of structural inclusion between process terms of the-calculus are considered, and proven to be decidable and to have axiom-atizations that are sound and complete in the multiset semantics M of the-calculus. All three are strong simulation relations.
متن کاملMultisets and Structural Congruence of the pi-Calculus with Replication
In the -calculus with replication, two processes are multiset congruent if they have the same semantics in the multiset transition system M . It is proved that (extended) structural congruence is the same as multiset congruence, and that it is decidable.
متن کاملA Multiset Semantics for the pi-Calculus with Replication
A multiset (or Petri net) semantics is de ned for the calculus with replication. The semantic mapping is a strong bisimulation, and structurally congruent processes have the same semantics. This paper is readable without knowledge of Petri nets.
متن کاملMatching in the Pi-Calculus
We study whether, in the π-calculus, the match prefix—a conditional operator testing two names for (syntactic) equality—is expressible via the other operators. Previously, Carbone and Maffeis proved that matching is not expressible this way under rather strong requirements (preservation and reflection of observables). Later on, Gorla developed a by now widely-tested set of criteria for encoding...
متن کاملThe pi-calculus
We formalise the pi-calculus using the nominal datatype package, based on ideas from the nominal logic by Pitts et al., and demonstrate an implementation in Isabelle/HOL. The purpose is to derive powerful induction rules for the semantics in order to conduct machine checkable proofs, closely following the intuitive arguments found in manual proofs. In this way we have covered many of the standa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2001
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(99)00330-8